Not only base rates are neglected in the Engineer-Lawyer problem: an investigation of reasoners' underutilization of complementarity.
نویسندگان
چکیده
The standard Engineer-Lawyer problem (Kahneman & Tversky, 1973) points to the failure of reasoners to integrate mentioned base-rate information in arriving at likelihood estimates. Research in this area nevertheless has presupposed that participants respect complementarity (i.e., participants ensure that competing estimates add up to 100%). A survey of the literature leads us to doubt this pre-supposition. We propose that the participants' non-normative performance on the standard Engineer-Lawyer problem reflects a reluctance to view the task probabilistically and that normative responses become more prominent as probabilistic aspects of the task do. In the present experiments, we manipulated two kinds of probabilistic cues and determined the extent to which (1) base rates were integrated and (2) the complementarity constraint was respected. In Experiment 1, six versions of an Engineer-Lawyer-type problem (that varied three levels of cue to complementarity and two base rates) were presented. The results showed that base-rate integration increased as cues to complementary did. Experiment 2 confirmed that Gigerenzer, Hell, and Blank's (1988) random-draw paradigm facilitates base-rate integration; a second measure revealed that it also prompts respect for complementarity. In Experiment 3, we replicated two of our main findings in one procedure while controlling for the potential influence of extraneous task features. We discuss approaches that describe how probabilistic cues might prompt normative responding.
منابع مشابه
A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملPower of the desired self: Influence of induced perceptions of the self on reasoning.
This research shows that the motivation to posses a desired characteristic (or to avoid an undesired one) results in self-perceptions that guide people's use of base rate in the Lawyer-Engineer problem (Kahneman & Tversky, 1973). In four studies, participants induced to believe (or recall, Exp. 2) that a rational cognitive style is success-conducive (or an intuitive cognitive style failure-cond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Memory & cognition
دوره 28 1 شماره
صفحات -
تاریخ انتشار 2000